Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix
نویسندگان
چکیده
منابع مشابه
Closest Vector Problem
The Closest Vector Problem (CVP) is a computational problem on lattices closely related to SVP. (See Shortest Vector Problem.) Given a lattice L and a target point ~x, CVP asks to find the lattice point closest to the target. As for SVP, CVP can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A more relaxed version of the ...
متن کاملSampling Short Lattice Vectors and the Closest Lattice Vector Problem
We present a 2 O(n) time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and computes a (1+)-approximation to CVP. As a consequence, using the SVP algorithm from 1], we obtain a randomized 2 O(1+ ?1)n algorithm to obtain a...
متن کاملA closest vector problem arising in radiation therapy planning
In this paper we consider the problem of finding a vector that can be written as a nonnegative, integer and linear combination of given 0-1 vectors, the generators, such that the l1-distance between this vector and a given target vector is minimized. We prove that this closest vector problem is NP-hard to approximate within an additive error of (ln 2− ǫ)d ≈ (0, 693 − ǫ) d for all ǫ > 0 where d ...
متن کاملul 2 00 9 A closest vector problem arising in radiation therapy planning ∗
In this paper we consider the problem of finding a vector that can be written as a nonnegative, integer and linear combination of given 0-1 vectors, the generators, such that the l1-distance between this vector and a given target vector is minimized. We prove that this closest vector problem is NP-hard to approximate within an additive error of (ln 2− ǫ)d ≈ (0, 693 − ǫ) d for all ǫ > 0 where d ...
متن کاملSolving the Closest Vector Problem with respect to ℓp Norms
We present deterministic polynomially space bounded algorithms for the closest vector problem for all lp-norms, 1 < p < ∞, and all polyhedral norms, in particular for the l1norm and the l∞-norm. For all lp-norms with 1 < p < ∞ the running time of the algorithm is p · log2(r)n, where r is an upper bound on the size of the coefficients of the target vector and the lattice basis and n is the dimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 42 شماره
صفحات -
تاریخ انتشار 1992